A Learnable Constraint-based Grammar Formalism
نویسنده
چکیده
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability results. The learnability result for LWFGs assumes that the semantic composition constraints are learnable. In this paper, we show what are the properties and principles the semantic representation and grammar formalism require, in order to be able to learn these constraints from examples, and give a learning algorithm. We also introduce a LWFG parser as a deductive system, used as an inference engine during LWFG induction. An example for learning a grammar for noun compounds is given.
منابع مشابه
PAC Learning Constraint Dependency Grammar Constraints
Constraint Dependency Grammar (CDG) 11, 13] is a constraint-based grammatical formalism that has proven eeective for processing English 5] and improving the accuracy of spoken language understanding systems 4]. However, prospective users of CDG face a steep learning curve when trying to master this powerful formalism. Therefore, a recent trend in CDG research has been to try to ease the burden ...
متن کاملA Learnable Representation for Syntax Using Residuated Lattices
We propose a representation for natural language syntax based on the theory of residuated lattices: in particular on the Galois lattice between contexts and substrings, which we call the syntactic concept lattice. The natural representation derived from this is a richly structured context sensitive formalism that can be learned using a generalisation of distributional learning. In this paper we...
متن کاملOn rigid NL Lambek grammars inference from generalized functor-argument data
This paper is concerned with the inference of categorial grammars, a context-free grammar formalism in the field of computational linguistics. A recent result has shown that whereas they are not learnable from strings in the model of Gold, rigid and k-valued non-associative Lambek grammars are still learnable from generalized functor-argument structured sentences. We focus here on the algorithm...
متن کاملConstraints Based Grammar Formalism for Japanese
The Japanese language has rather simple morphology and semanticsoriented syntax. It is also heavily context dependent in the sense that many constituents can be omitted. Thus we need to formalize Japanese grammar to take morphology, syntax, semantics and pragmatic factors into account. Based on CUProlog which is a constraint logic programming language, we have developed a grammar formalism for ...
متن کاملCHR Grammars with multiple constraint stores
CHR Grammars (CHRG) are a recent constraint-based grammar formalism added on top of CHR analogously to the way Definite Clause Grammars are defined and implemented over Prolog. A CHRG executes as an error robust bottom-up parser, and the formalism provides several advantages for natural language analysis reported elsewhere [4–6]. A notable property is CHRG’s inherent ability to handle abduction...
متن کامل